Variety Reasoning for Multiset Constraint Propagation

نویسندگان

  • Yat Chiu Law
  • Jimmy Ho-Man Lee
  • May H. C. Woo
چکیده

Set variables in constraint satisfaction problems (CSPs) are typically propagated by enforcing set bounds consistency together with cardinality reasoning, which uses some inference rules involving the cardinality of a set variable to produce more prunings than set bounds propagation alone. Multiset variables are a generalization of set variables by allowing the elements to have repetitions. In this paper, we generalize cardinality reasoning for multiset variables. In addition, we propose to exploit the variety of a multiset—the number of distinct elements in it—to improve modeling expressiveness and further enhance constraint propagation. We derive a number of inference rules involving the varieties of multiset variables. The rules interact varieties with the traditional components of multiset variables (such as cardinalities) to obtain stronger propagation. We also demonstrate how to apply the rules to perform variety reasoning on some common multiset constraints. Experimental results show that performing variety reasoning on top of cardinality reasoning can effectively reduce more search space and achieve better runtime in solving multiset CSPs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Comparison of Lex Bounds for Multiset Variables in Constraint Programming

Set and multiset variables in constraint programming have typically been represented using subset bounds. However, this is a weak representation that neglects potentially useful information about a set such as its cardinality. For set variables, the length-lex (LL) representation successfully provides information about the length (cardinality) and position in the lexicographic ordering. For mul...

متن کامل

Constraint Programming with Multisets

We propose extending constraint solvers with multiset variables. That is, variables whose values are multisets. Such an extension can help prevent introducing unnecessary symmetry into a model. We identify a number of different representations for multiset variables, and suggest primitive and global constraints on multiset variables. Surprisingly, unlike finite domain variables, decomposition o...

متن کامل

Constraint Propagation and Implementation Programme Committee Members of Programme Committee a Constraint Algebra

Many constraint toolkits provide logical connectives like disjunction, negation and implication that permit complex constraint expressions to be built from more primitive constraints. However, the propagation of complex constraints is typically delayed and so give little pruning. In this paper, we present a simple and light weight way to propagate such constraint expressions. We prove that comp...

متن کامل

Constraint Propagation

Constraint reasoning involves various types of techniques to tackle the inherent intractability of the problem of satisfying a set of constraints. Constraint propagation is one of those types of techniques. Constraint propagation is central to the process of solving a constraint problem, and we could hardly think of constraint reasoning without it. Constraint propagation is a very general conce...

متن کامل

Extending the Constraint Propagation of Intervals

We show that the usual notion of constraint propagation is but one of a number of similar inferences useful in quantitative reasoning about physical objects. These inferences are expressed formally as rules for the propagation of "labeled intervals" through equations. We prove the rules' correctness and illustrate their utility for reasoning about objects (such as motors or transmissions) which...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009